Data Clustering using Two-Stage Eagle Strategy Based on Slime Mould Algorithm

نویسندگان

چکیده

Dataclustering is considered an important component of data mining which aims tosplit a given dataset into disjoint groups having the same similarities. Thedeveloped techniques for clustering have some challenges to cluster entities incomplex search space and most them aim maximize sum inter-clusterdistances minimize intra-cluster distances. This objectivefunction nonlinear hard optimize especially complex space.Metaheuristics are becoming trend solving this task thanks theirpromising results. In study, eagle strategy used take advantageof exploration provided by Levy Flight (LF) exploitation strengthof Slime Mould Algorithm (SMA) solve problem. The SMAalgorithm efficient technique optimization problemswhich has high competence. On other hand, LF tends havegood exploratory behavior. Our exploits these advantages in balancedway through well-designed rounds ensure optimality clusteringsolutions. proposed method computationally inexpensive. Italso achieves accuracy terms average, worst, best, ofintra-cluster distance. also evaluated according speed ofconvergence using statistical tests, namely Wilcoxon. obtained resultsare compared with seven benchmarked metaheuristics, Grey Wolf Optimizer(GWO), (SMA), Whale Optimization (WOA), HarrisHawks (HHO), Sine Cosine (SCA), Multi-Verse Optimizer (MVO)and Genetic (GA) eighteen datasets shapes UCIrepositories.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Two-Stage Algorithm for Data Clustering

Cluster analysis is an important and popular data analysis technique that is used in a large variety of fields. K-means is a well-known and widely used clustering technique due to its simplicity in implementation and high speed in most situations. However, it suffers from two major shortcomings: it is very sensitive to the initial state of centroids and may converge to local optimum solution. I...

متن کامل

On Creativity of Slime Mould

Slime mould Physarum polycephalum is large single cell with intriguingly smart behaviour. The slime mould shows outstanding abilities to adapt its protoplasmic network to varying environmental conditions. The slime mould can solve tasks of computational geometry, image processing, logics and arithmetics when data are represented by configurations of attractants and repellents. We attempt to map...

متن کامل

Slime mould tactile sensor

Slime mould P. polycephalum is a single cells visible by unaided eye. The cells shows a wide spectrum of intelligent behaviour. By interpreting the behaviour in terms of computation one can make a slime mould based computing device. The Physarum computers are capable to solve a range of tasks of computational geometry, optimisation and logic. Physarum computers designed so far lack of localised...

متن کامل

Slime mould electronic oscillators

We construct electronic oscillator from acellular slime mould Physarum polycephalum. The slime mould oscillator is made of two electrodes connected by a protoplasmic tube of the living slime mould. A protoplasmic tube has an average resistance of 3 MOhm. The tube’s resistance is changing over time due to peristaltic contractile activity of the tube. The resistance of the protoplasmic tube oscil...

متن کامل

Slime Mould Memristors

In laboratory experiments we demonstrate that protoplasmic tubes of acellular slime mould Physarum polycephalum show current versus voltage profiles consistent with memristive systems and that the effect is due to the living protoplasm of the mould. This complements previous findings on memristive properties of other living systems (human skin and blood) and contributes to development of self-g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer Science

سال: 2022

ISSN: ['1552-6607', '1549-3636']

DOI: https://doi.org/10.3844/jcssp.2022.1062.1084